One-Clock Priced Timed Games with Negative Weights
نویسندگان
چکیده
Priced timed games are two-player zero-sum played on priced automata (whose locations and transitions labeled by weights modelling the cost of spending time in a state executing an action, respectively). The goals players to minimise maximise reach target location, respectively. We consider with one clock arbitrary integer show that, for important subclass them (the so-called simple games), can compute, pseudo-polynomial time, optimal values that achieve, their associated strategies. As side results, we also one-clock determined use our result solve more general class negative-reset-acyclic (with clock). decidability status full still remains open.
منابع مشابه
Almost Optimal Strategies in One Clock Priced Timed Games
We consider timed games extended with cost information, and prove computability of the optimal cost and of ε-optimal memoryless strategies in timed games with one clock. In contrast, this problem has recently been proved undecidable for timed games with three clocks.
متن کاملA Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that one-clock priced timed games can be solved in time m12n, where n is the number of states and m is the number of actions. The best previously known time bound for solving one-clock priced timed games was 2 2+m), due to Rutkowski. For our i...
متن کاملModel-Checking One-Clock Priced Timed Automata
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities. We prove that, under the assumption that the model has only one clock, model-checking this class ...
متن کاملAdding Negative Prices to Priced Timed Games
Priced timed games (PTGs) are two-player zero-sum games played on the infinite graph of configurations of priced timed automata where two players take turns to choose transitions in order to optimize cost to reach target states. Bouyer et al. and Alur, Bernadsky, and Madhusudan independently proposed algorithms to solve PTGs with nonnegative prices under certain divergence restriction over pric...
متن کاملOne Clock Priced Timed Automata: Model Checking and Optimal Strategies
In this paper, we consider priced (or weighted) timed automata, and prove various decidability results when the automaton has only one clock: we prove that model checking of WCTL is decidable and that optimal costs in priced timed games are computable. In contrast, it has recently been proved that these problems are undecidable for this model as soon as the system has three clocks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2022
ISSN: ['1860-5974']
DOI: https://doi.org/10.46298/lmcs-18(3:17)2022